A switching closure test to analyze cryptosystems ( Extended abstract )
نویسندگان
چکیده
The closure test MCT (meet-in-the-middle closure test) was introduced to analyze the algebraic properties of cryptosystems [KaRiSh]. Since MCT needs a large amount of memory, it is hard to implement with an ordinary meet-in-the-middle method. As a feasible version of MCT, this paper presents a switching closure test S C T which based on a new memoryless meet-in-the-middle method. To achieve the rnemoryless method, appropriate techniques, such as expansion of cycling detection methods for one function into a method for two funcaons and an efficient intersection search method that uses only a small amount of memory, are used in an extremely effective manner.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملThe Impact of Code-Switching on Bilingual EFL Learners’ Reading Comprehension
This study sought to investigate the probable effects of code-switching (CS) on Iranian bilingual English learners' reading comprehension. In this study, two intact classes of freshmen, taking the four-credit Reading and Comprehension Course 1, comprising a total of 70 participants, with 35 in each class, were randomly assigned as the experimental and the control groups after their initial homo...
متن کاملTiming Attacks against the Syndrome Inversion in Code-Based Cryptosystems
In this work we present new timing vulnerabilities that arise in the inversion of the error syndrome through the Extended Euclidean Algorithm that is part of the decryption operation of code-based Cryptosystems. We analyze three types of timing attack vulnerabilities theoretically and experimentally: The first allows recovery of the zero-element of the secret support, the second is a refinement...
متن کاملFrom torsion theories to closure operators and factorization systems
Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کامل